符号几何规划的一种分解方法

针对符号几何规划提出了一种直接的分解方法,将难于求解的符号几何规划问题等价地转化为一个非线性程度很低的可分离规划,为寻求困难度高且规模较大的符号几何规划问题的求解提供了一种方法,特别是经此方法分解后的每个子问题均易于求解,最后给出了数值实例,验证了此方法的有效性．     

基于界面跟踪方法的汽蚀模型和算法的有效性验证

针对两相附着汽蚀流动机理,基于界面跟踪方法发展了新的汽蚀模型和算法。所发展的汽蚀模型和算法不仅考虑了液相／气相界面处的压力差,而且考虑了耦合Reynolds-Averaged Navier-Stokes方程求解技术得到的流场压力梯度信息来迭代计算附着汽蚀形状。采用具有试验数据的半球形头部圆柱体汽蚀绕流作为算例来验证所提出的汽蚀模型和算法的有效性。采用不同的网格数和松弛因子数值验证了发展的汽蚀模型和算法的有效性。三种汽蚀数下的数值计算结果得到的压力系数分布与试验数据完全吻合。结果表明所提出的汽蚀模型和算法能够准确模拟出汽蚀发生点和汽蚀长度。     

关于正定可对称化线性代数方程组的预对称正则化算法

1引言考虑线性代数方程组A_x=b,A∈R~(n×n)非奇异,x,b∈R~n(1)的求解．当系数矩阵是大型稀疏的正定可对称化矩阵,文[1,2]讨论了一类预对称共轭梯度算法(LRSCG算法是其中之一),这类算法的实质是利用非对称的系数矩阵可对称化的性质,并结合共轭梯度法而构造的一种预处理的共轭梯度法[12,16,17]．但非对称的系数     

Synthesis and biological evaluation of 6-oxa-nor-tropane glycomimetics as glycosidase inhibitors

The preparation of polyhydroxylated 6-oxa-nor-tropane glycomimetics structurally related to the glycosidase inhibitor family of the calystegines is reported. The synthetic strategy involves the furanose→piperidine rearrangement of 5-deoxy-5-ureido-l-idose precursors, followed by intramolecular glycosylation involving the primary hydroxyl group. Inversion of the configuration at C-3 in the resulting 6-oxa-(+)-calystegine B₂ analogue allows accessing the elusive 3-epi-6-oxa-(+)-calystegine B₂ skeleton. Acid-catalyzed opening of the nor-tropane bicycle was observed, however, which could be avoided by careful neutralization of the reaction mixture. The inhibition results suggest that (+)-calystegine B₂ derivatives and the corresponding C-3 epimers can be seen as glucomimetics and galactomimetics, respectively, pointing to a 1-azasugar mode of action for this family of alkaloids.     

各向异性接合材料界面端部场数值分析

为了求解各向异性接合材料界面端部奇异性应力场,建立了一种新型杂交元模型.该模型的独特之处在于:基于有限元特征法得到的奇异性场数值特征解建立了一种新型界面端奇异单元.通过算例证明,新型杂交元模型能够利用较少的单元数获得较为精确的数值结果.当前模型应用范围广泛,能够用于复杂结构的界面端部场求解.     

微量元素制剂辅助治疗复发性口疮疗效观察

报道了１０３例ＲＡＵ患者使用微量元素制剂辅助治疗的临床疗效观察。将两个实验组分别与对照组比较。结果显示：应用锌、铁制剂辅助雷公藤、复方丹参等治疗的实验组Ｉ效果优于雷公藤、复方丹参对照组（Ｐ〈０．０１），而仅用锌、铁制剂治疗的实验组Ⅱ临床效果比对照组差（Ｐ〈０．０１），但锌、铁制剂有改善ＲＡＵ临床症状作用，而不能较好地控制其复发。     

Differential geometry of tensor product immersions

In this article we obtain the best possible estimates of the type number of tensor product immersions and investigate tensor product immersions with lowest possible type. Several classification theorems in this respect are then proved.     

Asymptotic properties of constrained Markov Decision Processes

We present in this paper several asymptotic properties of constrained Markov Decision Processes (MDPs) with a countable state space. We treat both the discounted and the expected average cost, with unbounded cost. We are interested in (1) the convergence of finite horizon MDPs to the infinite horizon MDP, (2) convergence of MDPs with a truncated state space to the problem with infinite state space, (3) convergence of MDPs as the discount factor goes to a limit. In all these cases we establish the convergence of optimal values and policies. Moreover, based on the optimal policy for the limiting problem, we construct policies which are almost optimal for the other (approximating) problems. Based on the convergence of MDPs with a truncated state space to the problem with infinite state space, we show that an optimal stationary policy exists such that the number of randomisations it uses is less or equal to the number of constraints plus one. We finally apply the results to a dynamic scheduling problem.This work was partially supported by the Chateaubriand fellowship from the French embassy in Israel and by the European Grant BRA-QMIPS of CEC DG XIII     

Discrete storage processes and their Poisson flow and fluid flow approximations

Consider discrete storage processes that are modulated by environmental processes. Environmental processes cause interruptions in the input and/or output processes of the discrete storage processes. Due to the difficulties encountered in the exact analysis of such discrete storage systems, often Poisson flow and/or fluid flow models with the same modulating environmental processes are proposed as approximations for these systems. The analysis of Poisson flow and fluid flow models is much easier than that of the discrete storage processes. In this paper we give sufficient conditions under which the content of the discrete storage processes can be bounded by the Poisson flow and the fluid flow models. For example, we show that Poisson flow models and the fluid flow models developed by Kosten (and by Anick, Mitra and Sondhi) can be used to bound the performance of infinite (finite) source packetized voice/data communication systems. We also show that a Poisson flow model and the fluid flow model developed by Mitra can be used to bound the buffer content of a two stage automatic transfer line. The potential use of the bounding techniques presented in this paper, of course, transcends well beyond these examples.Supported in part by NSF grant DMS-9308149.     

Curran猜想的解答

本文确定了能作为有限群自同构群的Ｐ－群的最佳下最，彻底解决了Ｃｕｒｒａｎ在１９８９年提出的关于此最佳下界的三个猜想。